Forking geometry on theories with an independent predicate
نویسنده
چکیده
We prove that a simple geometric theory of SU-rank 1 is n-ample if and only if the associated theory equipped with an predicate for an independent dense subset is n-ample for n at least 2.
منابع مشابه
Geometry of forking in simple theories
We investigate the geometry of forking for Urank 2 elements in supersimple ω-categorical theories and prove stable forking and some structural properties for such elements. We extend this analysis to the case of U-rank 3
متن کاملConsistent Amalgamation for Þ-forking Alf Onshuus and Clifton Ealy
This result follows straight from the geometric properties of þ-forking and it is nowhere near the independence theorem (which we will call “independent amalgamation”) one has in simple theories. In [?], Kim proved that the only independence relation satisfying symmetry, local character, transitivity and the independence theorem was forking in a simple theory; since there are well known example...
متن کاملQualifying Exam Syllabus
Basic constructions: The completeness and compactness theorems. The Löwenheim-Skolem theorem. Omitting types. Ultraproducts. Indiscernible sequences. Nice properties: Saturation, homogeneity, and the monster model. Elimination of imaginaries and Meq. Quantifier elimination. Model completeness. Countably categorical theories. Stable theories: Characterizations of a stable formula. Stable, supers...
متن کاملNon Forking Good Frames without Local Character
We continue [Sh:h].II, studying stability theory for abstract elementary classes. In [Sh E46], Shelah obtained a non-forking relation for an AEC, (K, ), with LST -number at most λ, which is categorical in λ and λ and has less than 2 + models of cardinality λ, but at least one. This non-forking relation satisfies the main properties of the non-forking relation on stable first order theories. Her...
متن کاملForking and dividing in NTP₂ theories
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded forking assuming NTP2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 54 شماره
صفحات -
تاریخ انتشار 2015